Reaction-diffusion on metric graphs: From 3D to 1D
نویسندگان
چکیده
We provide stochastic foundations for the analysis of a class of reaction-diffusion systems using as an example the known Temporal Analysis of Products (TAP) experiments, showing how to effectively obtain explicit solutions to the associated equations by approximating the 3-dimensional domain of diffusion U (the reactor) by 1-dimensional network models. In a typical TAP experiment a pulse of reactant gas of species A is injected into U , which is filled with chemically inert material, permeable to gas diffusion. Particles of catalyst are placed amid this inert medium, forming active sites where the reaction A→ B may occur. On part of the boundary of U designated as the exit, a mixture of A and B can escape. We study the problem of determining the (molar) fraction of product gas in the mixture after U is fully evacuated. This fraction is identified with the reaction probability—that is, the probability of a single diffusing molecule reacting before leaving U . Specifically, we are interested in how this probability depends on the reaction rate constant k. After giving a stochastic formulation of the problem and the boundary value problem whose solution is this probability, we study a class of domains, called fat graphs, comprising a network of thin tubes with active sites at junctures. The main result of the paper is that in the limit, as the thin tubes approach curves in 3-dimensional space, reaction probability converges to functions of the point of gas injection that can be computed explicitly in terms of a rescaled parameter k. By this 3D to 1D reduction, the simpler processes on metric graphs can be used as model systems for more realistic 3-dimensional configurations. This is illustrated with analytic and numerical examples. One example, in particular, illustrates an important application of our method: finding the catalyst configuration that maximizes reaction probability at a given reaction rate constant. Reaction-diffusion, metric graphs.
منابع مشابه
Extended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملSolving reaction–diffusion equations 10 times faster
The most popular numerical method for solving systems of reaction–diffusion equations continues to be a low order finite–difference scheme coupled with low order Euler time stepping. This paper extends previous 1D work and reports experiments that show that with high–order methods one can speed up such simulations for 2D and 3D problems by factors of 10–100. A short Matlab code (2/3D) that can ...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملTheory of bimolecular reactions in a solution with linear traps: Application to the problem of target search on DNA.
One-dimensional sliding along DNA as a means to accelerate protein target search is a well-known phenomenon occurring in various biological systems. Using a biomimetic approach, we have recently demonstrated the practical use of DNA-sliding peptides to speed up bimolecular reactions more than an order of magnitude by allowing the reactants to associate not only in the solution by three-dimensio...
متن کاملThe lower bound on the precision of transcriptional regulation
The diffusive arrival of transcription factors at the promoter sites on the DNA sets a lower bound on how accurately a cell can regulate its protein levels. Using results from the literature on diffusion-influenced reactions, we derive an analytical expression for the lower bound on the precision of transcriptional regulation. In our theory, transcription factors can perform multiple rounds of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 73 شماره
صفحات -
تاریخ انتشار 2017